Computer and Modernization ›› 2012, Vol. 1 ›› Issue (11): 142-144.doi: 10.3969/j.issn.1006-2475.2012.11.035

• 信息安全 • Previous Articles     Next Articles

Improved (k, n, t, m, p) Threshold Scheme Based on Order

GAO Zhen-dong1, ZHAO Peng-peng2   

  1. 1. School of Software and Service Outsourcing, Wuxi Professional College of Science and Technology, Wuxi 214028, China;2. School of Computer Science and Technology, Soochow University, Suzhou 215006, China
  • Received:2012-06-30 Revised:1900-01-01 Online:2012-11-10 Published:2012-11-10

Abstract: As an important method for secret sharing and key recovery, threshold scheme has been widely studied and applied since it has been proposed. Considering the needs of practical application and in order to enhance the security of traditional threshold scheme, this paper presents an improved threshold scheme based on order by approximate infinitely expanding the number of arrangement in the order of combination. So the attacker is difficult to recover the original secret even if he gets all shared secret. Thus, the security of threshold scheme is greatly increased, and the application of threshold scheme is expanded.

Key words: secret sharing, threshold, key, order, combination, arrangement

CLC Number: